Tutte polynomial

Results: 101



#Item
41Reasoning Algebraically About P-Solvable Loops Laura Kov´acs ? EPFL, Switzerland   Abstract. We present a method for generating polynomial invariants for a subfamily of imperative loops operating on

Reasoning Algebraically About P-Solvable Loops Laura Kov´acs ? EPFL, Switzerland Abstract. We present a method for generating polynomial invariants for a subfamily of imperative loops operating on

Add to Reading List

Source URL: www.complang.tuwien.ac.at

Language: English - Date: 2010-02-15 09:12:21
42Invariant Generation for P-solvable Loops with Assignments Laura Kov´acs ? EPFL, Swizterland

Invariant Generation for P-solvable Loops with Assignments Laura Kov´acs ? EPFL, Swizterland

Add to Reading List

Source URL: www.complang.tuwien.ac.at

Language: English - Date: 2010-02-15 09:12:21
43Multiplicative approximations of random walk transition probabilities Michael Kapralov∗ Rina Panigrahy†  June 17, 2011

Multiplicative approximations of random walk transition probabilities Michael Kapralov∗ Rina Panigrahy† June 17, 2011

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2014-12-09 10:13:50
44Lower Bounds for Monotone Counting Circuits Stasys Jukna1,2 Institute of Computer Science, Goethe University, Frankfurt am Main, Germany Abstract A {+, ×}-circuit counts a given multivariate polynomial f , if its values

Lower Bounds for Monotone Counting Circuits Stasys Jukna1,2 Institute of Computer Science, Goethe University, Frankfurt am Main, Germany Abstract A {+, ×}-circuit counts a given multivariate polynomial f , if its values

Add to Reading List

Source URL: lovelace.thi.informatik.uni-frankfurt.de

Language: English - Date: 2015-01-31 16:25:52
45Counting Arbitrary Subgraphs in Data Streams? Daniel M. Kane1 , Kurt Mehlhorn2 , Thomas Sauerwald2 , and He Sun2,3 1 3

Counting Arbitrary Subgraphs in Data Streams? Daniel M. Kane1 , Kurt Mehlhorn2 , Thomas Sauerwald2 , and He Sun2,3 1 3

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2012-05-07 09:56:40
4646th CGTC , March, Roots of graph polynomials Semantic vs Syntactic Properties of Graph Polynomials, I:

46th CGTC , March, Roots of graph polynomials Semantic vs Syntactic Properties of Graph Polynomials, I:

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2015-03-08 12:20:32
47University of Scranton ACM Student Chapter / Computing Sciences Department 20th Annual High School Programming Contest (2010) -----------------------------------------------------------------------------Problem 1: Multip

University of Scranton ACM Student Chapter / Computing Sciences Department 20th Annual High School Programming Contest (2010) -----------------------------------------------------------------------------Problem 1: Multip

Add to Reading List

Source URL: www.cs.uofs.edu

Language: English - Date: 2010-04-16 12:34:44
48Tilings Benjamin Blander Darren Lo  June 19, 2003

Tilings Benjamin Blander Darren Lo June 19, 2003

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2014-07-15 14:25:43
49ASYMPTOTIC ENUMERATION AND LIMIT LAWS OF PLANAR GRAPHS ´ OMER GIMENEZ AND MARC NOY

ASYMPTOTIC ENUMERATION AND LIMIT LAWS OF PLANAR GRAPHS ´ OMER GIMENEZ AND MARC NOY

Add to Reading List

Source URL: www-ma2.upc.edu

Language: English - Date: 2009-07-16 09:12:56
50Circular Chromatic Number and Circular Flow Number of Graphs Xuding Zhu Department of Applied Mathematics National Sun Yat-sen University, Taiwan to be prsented to the 2nd Pacific Rim Conference on Mathematics

Circular Chromatic Number and Circular Flow Number of Graphs Xuding Zhu Department of Applied Mathematics National Sun Yat-sen University, Taiwan to be prsented to the 2nd Pacific Rim Conference on Mathematics

Add to Reading List

Source URL: www.math.sinica.edu.tw

Language: English - Date: 2003-10-08 02:41:29